#include "..\CookHeader.h"

typedef  Array <Array <int>> Graph;
Graph initGraph(int size) {
    Graph G;
    Array <int> tmpAry;
    for (int i = 0; i < size; i++) {
        tmpAry.clear();
        for (int k = 0; k < size; k++)
            tmpAry.push_back(0);
        G.push_back(tmpAry);
    }
    return G;
}

Graph G1;
Array <string> nameAry = { "", "ֶ", "", "", "", "ȭ" };
int  = 0, ֶ = 1,  = 2,  = 3,  = 4, ȭ = 5;
Array <int> stack;
Array <int> visitedAry;

int main() {
    int gSize = 6;
    Graph G1 = initGraph(gSize);
    G1[][ֶ] = 1; G1[][] = 1;
    G1[ֶ][] = 1; G1[ֶ][] = 1;
    G1[][] = 1; G1[][] = 1;
    G1[][ֶ] = 1; G1[][] = 1; G1[][] = 1; G1[][ȭ] = 1;
    G1[][] = 1; G1[][ȭ] = 1;
    G1[ȭ][] = 1; G1[ȭ][] = 1;

    int current = 0;  //  
    stack.push_back(current);
    visitedAry.push_back(current);

    while (len(stack) != 0) {
        int next = -1;
        for (int vertex = 0; vertex < gSize; vertex++) {
            if (G1[current][vertex] == 1) {
                if (isInArray(visitedAry, vertex)) // 湮  ִ ̸ Ż
                {
                }
                else { // 湮     
                    next = vertex;
                    break;
                }
            }
        }
        if (next != -1) { //  湮  ִ 
            current = next;
            stack.push_back(current);
            visitedAry.push_back(current);
        }
        else { //  湮   
            current = stack[len(stack) - 1];
            stack.pop_back();
        }
    }

    print("湮 -->");
    for (int i = 0; i < len(visitedAry); i++)
        print(nameAry[visitedAry[i]]);

}